package greedyAlgorithm;

public class minSubArrayLen {
    public static int minSubArrayLen(int target, int[] nums) {
           int n=nums.length;
           int len=Integer.MAX_VALUE;
           int sum=0;
           for(int left=0,right=0;right<n;right++){
               sum+=nums[right];
               while (sum>=target){
                   len=Math.min(len,right-left+1);
                   sum-=nums[left++];
               }
           }
          return len==Integer.MAX_VALUE?0:len;
    }

    public static void main(String[] args) {
        int[] nums={2,3,1,2,4,3};
        System.out.println(minSubArrayLen(7, nums));
    }
}
